Two-Phase Influence Maximization in Social Networks with Seed Nodes and Referral Incentives
نویسندگان
چکیده
The problem of maximizing the spread of influence with a limited budget is central to social networks research. Most problems addressed in existing literature spend the entire budget towards triggering diffusion at seed nodes. In this paper, we investigate the effect of splitting the budget across two sequential phases; each phase corresponds to a different way of spreading influence. In phase 1, we adopt the classical approach of triggering diffusion at a selected set of seed nodes to spread the influence. In phase 2, we use the remaining budget to offer referral incentives. Assuming the independent cascade model, we formulate an objective function for the above two-phase influence maximization problem, and investigate its properties. We determine an effective budget-split between the two phases with detailed experiments on synthetic and real-world datasets. The principal findings from our study are: (a) when the budget is low, it is prudent to use the entire budget for phase 1; (b) when the budget is moderate to high, it is preferable to use much of the budget for phase 1, while allocating the remaining budget to phase 2; (c) in the presence of moderate to strict temporal constraints, phase 2 is not warranted; (d) if the temporal constraints are low or absent, referral incentives (phase 2) yield a decisive improvement in influence spread.
منابع مشابه
A Multi-phase Approach for Improving Information Diffusion in Social Networks
For maximizing influence spread in a social network, given a certain budget on the number of seed nodes, we investigate the effects of selecting and activating the seed nodes in multiple phases. In particular, we formulate an appropriate objective function for two-phase influence maximization under the independent cascade model, investigate its properties, and propose algorithms for determining...
متن کاملMulti-objective Evolutionary Algorithms for Influence Maximization in Social Networks
As the pervasiveness of social networks increases, new NPhard related problems become interesting for the optimization community. The objective of influence maximization is to contact the largest possible number of nodes in a network, starting from a small set of seed nodes, and assuming a model for information propagation. This problem is of utmost practical importance for applications ranging...
متن کاملThe Influence of Location on Nodes’ Centrality in Location-Based Social Networks
Nowadays, due to the widespread use of social networks, they can be used as a convenient, low-cost, and affordable tool for disseminating all kinds of information and data among the massive users of these networks. Issues such as marketing for new products, informing the public in critical situations, and disseminating medical and technological innovations are topics that have been considered b...
متن کاملA Behavioral Analysis on the Reselection of Seed Nodes in Independent Cascade Based Influence Maximization
Influence maximization serves as the main goal of a variety of social network activities such as viral marketing and campaign advertising. The independent cascade model for the influence spread assumes a one-time chance for each activated node to influence its neighbors. This reasonable assumption cannot be bypassed, since otherwise the influence probabilities of the nodes, modeled by the edge ...
متن کاملDiscovering groups of key potential customers in social networks: A multi-objective optimization model
Nowadays, the popularity of social networks as marketing tools has brought a deal of attention to social networks analysis (SNA). One of the well-known Problems in this field is influence maximization problems which related to flow of information within networks. Although, the problem have been considered by many researchers, the concept behind of this problem has been used less in business con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017